See depth-first search on Wiktionary
{
"forms": [
{
"form": "depth-first searches",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "depth-first search (countable and uncountable, plural depth-first searches)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Finnish translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Icelandic translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Polish translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"text": "Coordinate term: breadth-first search"
}
],
"glosses": [
"An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking."
],
"id": "en-depth-first_search-en-noun-yEpz-AA-",
"links": [
[
"graph theory",
"graph theory"
],
[
"algorithm",
"algorithm"
],
[
"traversing",
"traverse"
],
[
"backtrack",
"backtrack"
]
],
"raw_glosses": [
"(graph theory) An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking."
],
"synonyms": [
{
"word": "DFS"
}
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"translations": [
{
"code": "fi",
"lang": "Finnish",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"word": "syvyyshaku"
},
{
"code": "de",
"lang": "German",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"tags": [
"feminine"
],
"word": "Tiefensuche"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"tags": [
"feminine"
],
"word": "lóðleit"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"tags": [
"feminine"
],
"word": "dýptarleit"
},
{
"code": "pl",
"lang": "Polish",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"tags": [
"neuter"
],
"word": "przeszukiwanie wgłąb"
}
]
}
],
"word": "depth-first search"
}
{
"forms": [
{
"form": "depth-first searches",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "depth-first search (countable and uncountable, plural depth-first searches)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Finnish translations",
"Terms with German translations",
"Terms with Icelandic translations",
"Terms with Polish translations",
"en:Graph theory"
],
"examples": [
{
"text": "Coordinate term: breadth-first search"
}
],
"glosses": [
"An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"algorithm",
"algorithm"
],
[
"traversing",
"traverse"
],
[
"backtrack",
"backtrack"
]
],
"raw_glosses": [
"(graph theory) An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking."
],
"synonyms": [
{
"word": "DFS"
}
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"translations": [
{
"code": "fi",
"lang": "Finnish",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"word": "syvyyshaku"
},
{
"code": "de",
"lang": "German",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"tags": [
"feminine"
],
"word": "Tiefensuche"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"tags": [
"feminine"
],
"word": "lóðleit"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"tags": [
"feminine"
],
"word": "dýptarleit"
},
{
"code": "pl",
"lang": "Polish",
"sense": "algorithm where one starts at the root and explores as far as possible down before going up",
"tags": [
"neuter"
],
"word": "przeszukiwanie wgłąb"
}
],
"word": "depth-first search"
}
Download raw JSONL data for depth-first search meaning in All languages combined (2.3kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.